Search results for "Generic matrices"
showing 3 items of 3 documents
Defining relations of minimal degree of the trace algebra of 3×3 matrices
2008
Abstract The trace algebra C n d over a field of characteristic 0 is generated by all traces of products of d generic n × n matrices, n , d ⩾ 2 . Minimal sets of generators of C n d are known for n = 2 and n = 3 for any d as well as for n = 4 and n = 5 and d = 2 . The defining relations between the generators are found for n = 2 and any d and for n = 3 , d = 2 only. Starting with the generating set of C 3 d given by Abeasis and Pittaluga in 1989, we have shown that the minimal degree of the set of defining relations of C 3 d is equal to 7 for any d ⩾ 3 . We have determined all relations of minimal degree. For d = 3 we have also found the defining relations of degree 8. The proofs are based …
Defining relations of the noncommutative trace algebra of two 3×3 matrices
2006
The noncommutative (or mixed) trace algebra $T_{nd}$ is generated by $d$ generic $n\times n$ matrices and by the algebra $C_{nd}$ generated by all traces of products of generic matrices, $n,d\geq 2$. It is known that over a field of characteristic 0 this algebra is a finitely generated free module over a polynomial subalgebra $S$ of the center $C_{nd}$. For $n=3$ and $d=2$ we have found explicitly such a subalgebra $S$ and a set of free generators of the $S$-module $T_{32}$. We give also a set of defining relations of $T_{32}$ as an algebra and a Groebner basis of the corresponding ideal. The proofs are based on easy computer calculations with standard functions of Maple, the explicit prese…
Defining relations of minimal degree of the trace algebra of 3 X 3 matrices
2008
The trace algebra Cnd over a field of characteristic 0 is generated by all traces of products of d generic n × n matrices, n, d 2. Minimal sets of generators of Cnd are known for n = 2 and n = 3 for any d as well as for n = 4 and n = 5 and d = 2. The defining relations between the generators are found for n = 2 and any d and for n = 3, d = 2 only. Starting with the generating set of C3d given by Abeasis and Pittaluga in 1989, we have shown that the minimal degree of the set of defining relations of C3d is equal to 7 for any d 3. We have determined all relations of minimal degree. For d = 3 we have also found the defining relations of degree 8. The proofs are based on methods of representati…